Search Problems in the Decision Tree Model Ll Aszll O Lovv Asz
نویسندگان
چکیده
We study the relative power of determinism, randomness and nondeterminism for search problems in the Boolean decision tree model. We show that the gaps between the nondeterministic, the randomized and the deterministic complexities can be arbitrary large for search problems. We also mention an interesting connection of this model to the complexity of resolution proofs.
منابع مشابه
Isoperimetric Problems for Convex Bodies and a Localization Lemama
1 LL aszll o Lovv asz 2 and Mikll os Simonovits 3 Abstract. We study the smallest number (K) such that a given convex body K in IR n can be cut into two parts K 1 and K 2 by a surface with an (n ? 1)-dimensional measure (K)vol(K 1) vol(K 2)=vol(K). Let M 1 (K) be the average distance of a point of K from its center of gravity. We prove for the \isoperimetric coeecient" that and give other upper...
متن کامل658 Michel
We describe a few applications of semideenite programming in combinatorial optimization. Semideenite programming is a special case of convex programming where the feasible region is an aane subspace of the cone of positive semideenite matrices. There has been much interest in this area lately, partly because of applications in com-binatorial optimization and in control theory and also because o...
متن کاملOn a Min-max Theorem of Cacti
A simple proof is presented for the min-max theorem of Lovv asz on cacti. Instead of using the result of Lovv asz on matroid parity, we shall apply twice the (conceptionally simpler) matroid intersection theorem.
متن کاملFast Algorithms for Finding O ( Congestion + Dilation ) Packet Routing
In 1988, Leighton, Maggs, and Rao showed that for any network and any set of packets whose paths through the network are xed and edge-simple, there exists a schedule for routing the packets to their destinations in O(c+d) steps using constant-size queues, where c is the congestion of the paths in the network, and d is the length of the longest path. The proof, however, used the Lovv asz Local L...
متن کاملFast Algorithms for Finding O ( Congestion + Dilation ) Packet
In 1988, Leighton, Maggs, and Rao showed that for any network and any set of packets whose paths through the network are xed and edge-simple, there exists a schedule for routing the packets to their destinations in O(c + d) steps using constant-size queues, where c is the congestion of the paths in the network, and d is the length of the longest path. The proof, however, used the Lovv asz Local...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001